A fast Newton–Raphson based iterative algorithm for large scale optimal contribution selection
نویسندگان
چکیده
منابع مشابه
A partition-based algorithm for clustering large-scale software systems
Clustering techniques are used to extract the structure of software for understanding, maintaining, and refactoring. In the literature, most of the proposed approaches for software clustering are divided into hierarchical algorithms and search-based techniques. In the former, clustering is a process of merging (splitting) similar (non-similar) clusters. These techniques suffered from the drawba...
متن کاملFast SFFS-Based Algorithm for Feature Selection in Biomedical Datasets
Biomedical datasets usually include a large number of features relative to the number of samples. However, some data dimensions may be less relevant or even irrelevant to the output class. Selection of an optimal subset of features is critical, not only to reduce the processing cost but also to improve the classification results. To this end, this paper presents a hybrid method of filter and wr...
متن کاملCONSTRAINED BIG BANG-BIG CRUNCH ALGORITHM FOR OPTIMAL SOLUTION OF LARGE SCALE RESERVOIR OPERATION PROBLEM
A constrained version of the Big Bang-Big Crunch algorithm for the efficient solution of the optimal reservoir operation problems is proposed in this paper. Big Bang-Big Crunch (BB-BC) algorithm is a new meta-heuristic population-based algorithm that relies on one of the theories of the evolution of universe namely, the Big Bang and Big Crunch theory. An improved formulation of the algorithm na...
متن کاملfast sffs-based algorithm for feature selection in biomedical datasets
biomedical datasets usually include a large number of features relative to the number of samples. however, some data dimensions may be less relevant or even irrelevant to the output class. selection of an optimal subset of features is critical, not only to reduce the processing cost but also to improve the classification results. to this end, this paper presents a hybrid method of filter and wr...
متن کاملFISA: Fast Iterative Signature Algorithm for the analysis of large-scale gene expression data
One approach to reduce the complexity of the task in the analysis of large scale genome-wide expression is to group the genes showing similar expression patterns into what are called transcription modules (TM). A TM is defined as a set of genes and a set of conditions under which these genes are most tightly co-expressed. Most of the existing algorithms compute non-overlapping TMs whereas a gen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Genetics Selection Evolution
سال: 2016
ISSN: 1297-9686
DOI: 10.1186/s12711-016-0249-2